Prolegomena to O-minimalism: Definable Completeness, Type Completeness, and Tameness
نویسنده
چکیده
An ordered structure is called o-minimalistic if it has all the first-order features of an o-minimal structure. In this paper, we concentrate on a well-known fragment DCTC (Definable Completeness/Type Completeness) and generalize o-minimal properties to this more general situation (dimension theory, monotonicity, Hardy structures, quasi-cell decomposition) upon replacing finiteness by discreteness in all of these. Failure of cell decomposition leads to the related notion of a tame structure. §
منابع مشابه
Suzuki-type fixed point theorems for generalized contractive mappings that characterize metric completeness
Inspired by the work of Suzuki in [T. Suzuki, A generalized Banach contraction principle that characterizes metric completeness, Proc. Amer. Math. Soc. 136 (2008), 1861--1869], we prove a fixed point theorem for contractive mappings that generalizes a theorem of Geraghty in [M.A. Geraghty, On contractive mappings, Proc. Amer. Math. Soc., 40 (1973), 604--608]an...
متن کاملDASTWAR: a tool for completeness estimation in magnitude-size plane
Today, great observatories around the world, devote a substantial amount of observing time to sky surveys. The resulted images are inputs of source finder modules. These modules search for the target objects and provide us with source catalogues. We sought to quantify the ability of detection tools in recovering faint galaxies regularly encountered in deep surveys. Our approach was based on com...
متن کاملDISTINGUISHABILITY AND COMPLETENESS OF CRISP DETERMINISTIC FUZZY AUTOMATA
In this paper, we introduce and study notions like state-\linebreak distinguishability, input-distinguishability and output completeness of states of a crisp deterministic fuzzy automaton. We show that for each crisp deterministic fuzzy automaton there corresponds a unique (up to isomorphism), equivalent distinguished crisp deterministic fuzzy automaton. Finally, we introduce two axioms related...
متن کاملEquality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملRelationships between completeness of fuzzy quasi-uniform spaces
In this paper, we give a kind of Cauchy 1-completeness in probabilistic quasi-uniform spaces by using 1-filters. Utilizingthe relationships among probabilistic quasi-uniformities, classical quasi-uniformities and Hutton [0, 1]-quasi-uniformities,we show the relationships between their completeness. In fuzzy quasi-metric spaces, we establish the relationshipsbetween the completeness of induced p...
متن کامل